Method and system for completing loosely specified mdts

ABSTRACT

A method is implemented by a networking device that is functioning as a computing node. The method resolves sub-trees of a loosely specified multicast distribution tree (MDT). The method utilizes global identifiers for sub-trees to enable differentiation of traffic of different sub-trees at shared replication nodes. The method is implemented at each of the nodes of the network that are part of the MDT.

FIELD

Embodiments of the invention relate to the field of multicast routing.In particular, the embodiments relate to a process for handling thedetermination of multicast distribution trees (MDTs) that have beenloosely specified, in a manner that is efficient and is resilientagainst looping even when topology changes conflict with the loosespecification of the tree.

BACKGROUND

Numerous techniques and protocols exist for configuring networks tohandle multicast traffic. For Internet Protocol (IP) and/ormultiprotocol label switching (MPLS) implementations the existingsolutions for multicast are based on multicast label distributionprotocol (mLDP) or protocol independent multicast (PIM). These are alltechniques that depend on a unicast shortest path first (SPF)computation followed by handshaking between peers to sort out a loopfree multicast distribution tree (MDT) for each multicast source. At thesame time numerous protocols exist that provide for unicast tunneling,and some (such as label based architectures like source packet routingin networking (SPRING) or MPLS-LDP) implement a full mesh of unicasttunnels as an artifact for normal operation.

SPB is a networking system for the configuration of computer networksthat enables multipath routing. In one embodiment, the protocol isspecified by the Institute of Electrical and Electronics Engineers(IEEE) 802.1aq standard. This networking system utilized a link staterouting system as a replacement for prior standards such as spanningtree protocols. SPB enables all paths in the computing network to beactive with multiple equal costs paths being utilized through loadsharing and similar technologies. The standard enables theimplementation of logical Ethernet networks in Ethernet infrastructuresusing a link state protocol to advertise the topology and logicalnetwork memberships of the nodes in the network. SPB implements largescale multicast as part of implementing virtualized broadcast domains.

Proposals have been made to use global identifiers in the dataplanecombined with the IEEE 802.1aq technique of advertising multicastregistrations in the interior gateway protocol (IGP) and using an “allpairs shortest path” computation to compute MDTs without the additionalhandshaking of existing multicast protocols.

SPRING is an exemplary profile of the use of MPLS technology wherebyglobal identifiers are used in the form of a global label assigned toeach label switched router (LSR) that is used for forwarding to thatLSR. A full mesh of unicast tunnels is constructed via every node in thenetwork computing the shortest path to every other node and installingthe associated global labels accordingly. In the case of SPRING, thisalso allows explicit paths to be set up via the application of labelstacks at the network ingress which specify the path that the packetshould traverse expressed as a set of waypoints. Encompassed with thisapproach is the concept of a strict (every hop specified) or loose (somewaypoints specified) route dependent on how exhaustively the ingressapplied label stack specifies the path. SPRING, RSVP-TE and othertechnologies have a concept of loosely specified paths where only aportion of a path is specified and the network locally fills in the reston the basis of local topology knowledge. It would be useful to havethis capability for multicast trees.

mLDP and PIM do not have a facility to permit any engineering ofmulticast trees in that way points cannot be specified. Any resultingMDT simply follows the shortest path established by unicast convergence.RSVP-TE does have extensions that permit engineered trees to bespecified, but this results in significant control plane traffic andstate.

To combat some of these issues methods have been defined to implementengineered multicast forwarding. These methods utilize loosely specifiedtrees. A loosely specified tree is one in which not every hop in thetree is specified, only some hops are specified as “way points.” Thisresults in a tree being defined as a cascade of sub-trees where thelocation of the sub-tree roots has been specified or “pinned.” Asub-tree is a portion of the overall tree where an intermediate root anda set of leaves has been explicitly defined. As used herein a stage ofan MDT refers to the set of sub-trees that are an equal number ofcascaded subtrees from the root.

Pinning intermediate points in the MDTs where the hops are looseintroduces some issues. The overall resulting tree cannot be guaranteedto be acyclic across topology changes. The resulting tree will not beoptimal across topology changes. The result is that although it isdesirable to be able to specify or ‘pin’ hops in a tree for engineeringand traffic distribution purposes, it cannot be reliably done with aflat multicast tree with invariant identifiers if there is a combinationof pinned points and computed portions of the MDT.

Methods have been introduced where unicast tunneling is used between aroot, replication trees and leaves that implement each MDT to reduce theproblems of loosely specified trees. However, these methods do noteliminate the possibility of acyclic trees in the presence of pinnedwaypoints as tunnel collisions such that they will not result in loopingor duplication. However, a mix of pinned and computed trees may stillpresent issues. In such a topology, changes in the topology may resultin a single node resolving to being a replication tree for multiple subtrees of the overall tree. This can lead to problems in forwarding andcongestion without a method of disambiguating the subtrees in theforwarding plane.

SUMMARY

In one embodiment, a method is implemented by a networking deviceoperating as a computing node. The method resolves sub-trees of aloosely specified multicast distribution tree (MDT). The method utilizesglobal identifiers for sub-trees to enable differentiation of traffic ofdifferent sub-trees at shared replication nodes. The method isimplemented at each of the nodes of the network that are part of theMDT. The method includes selecting a sub-tree in the set of sub-trees inthe MDT rooted at a current node, computing a selected sub-tree fromroot to leaves, and generating a translation of sub-tree identifiersbetween the sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.

In another embodiment, a network device is configured to implement amethod to resolve sub-trees of a loosely specified multicastdistribution tree (MDT). The method utilizes global identifiers forsub-trees to enable differentiation of traffic of different sub-trees atshared replication nodes. The method is implemented at each of the nodesof the network that are part of the MDT. The network device includes anon-transitory machine-readable medium to store a sub-tree computationmodule, and a processor coupled to the non-transitory machine-readablemedium to store a sub-tree computation module. The sub-tree computationmodule is configured to select a next sub-tree in the set of sub-treesin the MDT rooted at a current node, to compute a selected sub-tree fromroot to leaves, and to generate a translation of sub-tree identifiersbetween the sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.

In a further embodiment, a computing device is in communication with anetwork device in a network with a plurality of network devices. Thecomputing device is configured to execute a plurality of virtualmachines for implementing network function virtualization (NFV), whereina virtual machine from the plurality of virtual machines is configuredto implement a method to resolve sub-trees of a loosely specifiedmulticast distribution tree (MDT). The method utilizes globalidentifiers for sub-trees to enable differentiation of traffic ofdifferent sub-trees at shared replication nodes. The method isimplemented at each of the nodes of the network that are part of theMDT. The network device includes a non-transitory machine-readablemedium to store a sub-tree computation module, and a processor coupledto the non-transitory machine-readable medium to store a sub-treecomputation module, the sub-tree computation module configured to selecta next sub-tree in the set of sub-trees in the MDT rooted at a currentnode, to compute a selected sub-tree from root to leaves, and togenerate a translation of sub-tree identifiers between the sub-treeidentifiers of the selected sub-tree and a sub-tree identifier of anupstream sub-tree, in response to the computing node being the sub-treeroot of the selected sub-tree.

In on embodiment, a control plane device is configured to implement acontrol plane of a software defined networking (SDN) network including anetwork device in a network with a plurality of network devices, whereinthe control plane device is configured to implement a method to resolvesub-trees of a loosely specified multicast distribution tree (MDT). Themethod utilizes global identifiers for sub-trees to enabledifferentiation of traffic of different sub-trees at shared replicationnodes. The method is implemented at each of the nodes of the networkthat are part of the MDT. The control plane device is a non-transitorymachine-readable medium to store a sub-tree computation module. Aprocessor coupled to the non-transitory machine-readable medium to storea sub-tree computation module, the sub-tree computation moduleconfigured to select a next sub-tree in the set of sub-trees in the MDTrooted at a current node, to compute a selected sub-tree from root toleaves, and to generate a translation of sub-tree identifiers betweenthe sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention may best be understood by referring to the followingdescription and accompanying drawings that are used to illustrateembodiments of the invention. In the drawings:

FIG. 1 is a diagram of one example network topology for a multicastdistribution tree (MDT).

FIG. 2 is a diagram of one embodiment of a replication node for multiplesub-trees.

FIG. 3 is a diagram of one embodiment of a replication node for multiplesub-trees where the traffic for each is distinguished.

FIG. 4 is a flowchart of the process for computing sub-trees of the MDT.

FIG. 5 is a diagram of one embodiment of the network and MDT thatillustrates how the embodiments handle the failure of a sub-tree root.

FIG. 6 is a diagram of one embodiment of a network device implementingthe sub-tree computation module.

FIG. 7A illustrates connectivity between network devices (NDs) within anexemplary network, as well as three exemplary implementations of theNDs, according to some embodiments of the invention.

FIG. 7B illustrates an exemplary way to implement a special-purposenetwork device according to some embodiments of the invention.

FIG. 7C illustrates various exemplary ways in which virtual networkelements (VNEs) may be coupled according to some embodiments of theinvention.

FIG. 7D illustrates a network with a single network element (NE) on eachof the NDs, and within this straight forward approach contrasts atraditional distributed approach (commonly used by traditional routers)with a centralized approach for maintaining reachability and forwardinginformation (also called network control), according to some embodimentsof the invention.

FIG. 7E illustrates the simple case of where each of the NDs implementsa single NE, but a centralized control plane has abstracted multiple ofthe NEs in different NDs into (to represent) a single NE in one of thevirtual network(s), according to some embodiments of the invention.

FIG. 7F illustrates a case where multiple VNEs are implemented ondifferent NDs and are coupled to each other, and where a centralizedcontrol plane has abstracted these multiple VNEs such that they appearas a single VNE within one of the virtual networks, according to someembodiments of the invention.

FIG. 8 illustrates a general purpose control plane device withcentralized control plane (CCP) software, according to some embodimentsof the invention.

DESCRIPTION OF EMBODIMENTS

The following description describes methods and apparatus for computingloosely specified sub-trees of a multicast distribution tree. Themethods and apparatus utilize a unique dataplane source, group (S, G)identifier for each pinned (i.e., specified) root or waypoint in thenetwork or MDT and translating the received (S, G) identifier to a newidentifier for the next sub-tree. Existing techniques will ensure thatany individual sub-tree between pinned points and a set of leaves isacyclic and the translation of identifiers such that sub-trees can bedisambiguated in the dataplane ensures that if a topology change resultsin an MDT that is acyclic, an actual forwarding loop will not form, norwill there be duplicate delivery of packets to any receivers. Thesub-tree labels are global and the description of the subtree isdisseminated in the control plane such that any node in the network hassufficient information to determine if it needs to install state for agiven sub-tree, as it may be required to do as a result of needing torespond to arbitrary topology changes.

Thus the embodiments provide that subtrees are specified as a set ofleaves and a root in the control plane just as a complete MDT would beand in addition these sub-trees are then stitched together to producethe overall MDT such that each sub-tree uses a unique identifier in thedataplane so that a non-acyclic overall tree is composed of acycliccomponents that can be disambiguated from each other.

In the following description, numerous specific details such as logicimplementations, opcodes, means to specify operands, resourcepartitioning/sharing/duplication implementations, types andinterrelationships of system components, and logicpartitioning/integration choices are set forth in order to provide amore thorough understanding of the present invention. It will beappreciated, however, by one skilled in the art that the invention maybe practiced without such specific details. In other instances, controlstructures, gate level circuits and full software instruction sequenceshave not been shown in detail in order not to obscure the invention.Those of ordinary skill in the art, with the included descriptions, willbe able to implement appropriate functionality without undueexperimentation.

References in the specification to “one embodiment,” “an embodiment,”“an example embodiment,” etc., indicate that the embodiment describedmay include a particular feature, structure, or characteristic, butevery embodiment may not necessarily include the particular feature,structure, or characteristic. Moreover, such phrases are not necessarilyreferring to the same embodiment. Further, when a particular feature,structure, or characteristic is described in connection with anembodiment, it is submitted that it is within the knowledge of oneskilled in the art to affect such feature, structure, or characteristicin connection with other embodiments whether or not explicitlydescribed.

Bracketed text and blocks with dashed borders (e.g., large dashes, smalldashes, dot-dash, and dots) may be used herein to illustrate optionaloperations that add additional features to embodiments of the invention.However, such notation should not be taken to mean that these are theonly options or optional operations, and/or that blocks with solidborders are not optional in certain embodiments of the invention.

In the following description and claims, the terms “coupled” and“connected,” along with their derivatives, may be used. It should beunderstood that these terms are not intended as synonyms for each other.“Coupled” is used to indicate that two or more elements, which may ormay not be in direct physical or electrical contact with each other,co-operate or interact with each other. “Connected” is used to indicatethe establishment of communication between two or more elements that arecoupled with each other.

An electronic device stores and transmits (internally and/or with otherelectronic devices over a network) code (which is composed of softwareinstructions and which is sometimes referred to as computer program codeor a computer program) and/or data using machine-readable media (alsocalled computer-readable media), such as machine-readable storage media(e.g., magnetic disks, optical disks, read only memory (ROM), flashmemory devices, phase change memory) and machine-readable transmissionmedia (also called a carrier) (e.g., electrical, optical, radio,acoustical or other form of propagated signals—such as carrier waves,infrared signals). Thus, an electronic device (e.g., a computer)includes hardware and software, such as a set of one or more processorscoupled to one or more machine-readable storage media to store code forexecution on the set of processors and/or to store data. For instance,an electronic device may include non-volatile memory containing the codesince the non-volatile memory can persist code/data even when theelectronic device is turned off (when power is removed), and while theelectronic device is turned on that part of the code that is to beexecuted by the processor(s) of that electronic device is typicallycopied from the slower non-volatile memory into volatile memory (e.g.,dynamic random access memory (DRAM), static random access memory (SRAM))of that electronic device. Typical electronic devices also include a setor one or more physical network interface(s) to establish networkconnections (to transmit and/or receive code and/or data usingpropagating signals) with other electronic devices. One or more parts ofan embodiment of the invention may be implemented using differentcombinations of software, firmware, and/or hardware.

A network device (ND) is an electronic device that communicativelyinterconnects other electronic devices on the network (e.g., othernetwork devices, end-user devices). Some network devices are “multipleservices network devices” that provide support for multiple networkingfunctions (e.g., routing, bridging, switching, Layer 2 aggregation,session border control, Quality of Service, and/or subscribermanagement), and/or provide support for multiple application services(e.g., data, voice, and video).

Overview

FIG. 1 is a diagram of one embodiment of a MDT that has been looselyspecified. The loosely specified MDT includes a root that is the ingresspoint for multicast traffic to be distributed by the MDT and a set ofsub-trees that are a portion of the overall tree where an intermediateroot is specified and where a set of leaves and/or further sub-treeroots are also specified. The sub-trees can be described as a set ofstages. Each stage is a set of the sub-trees with an equal number ofpinned hops (in the form of sub-tree roots) from the root. In FIG. 1,the root of the MDT is on the left hand side of the diagram andconnected to a single sub-tree. However, a root can be connected tomultiple sub-trees. The illustrated MDT is provided by way of exampleand not limitation, thus the MDT can have any size and organization ofsub-trees and leaves. Similarly, the MDTs with any number of stages andany number of sub-trees can be specified.

The sub-tree directly connected to the root is the only sub-tree instage one. This sub-tree has two replication nodes as leaves that serveas the roots of two separate sub-trees in the second stage. Thesub-trees in the second stage have a set of leaves and one of thesub-trees has two replication trees that serve as sub-tree roots for thesub-trees of the third stage. Thus, any given sub-tree can serve anarbitrary number of downstream subtrees (including none). In the thirdstage of the example MDT there are no downstream replication trees. Thetwo third stage sub-trees deliver multicast traffic exclusively toleaves. Similarly, a given sub-tree only includes a single root connectto single sub-tree in the preceding stage. However, though notillustrated in this example and likely not utilized in practice, one canenvision that a single node can be the root for multiple sub-trees.

Thus, one of the issues of the prior art systems is the handling oftraffic at nodes that are replication trees for multiple trees and forthe handling of changes in topology. In other words, pinningintermediate points in an MDT where the hops are loose is problematic inthe prior art in that the capability does not exist in multicast systemsthat use transactional convergence as there is no means of expressingway points and very state intensive for signaled systems. The resultingMDT cannot be guaranteed to be acyclic across topology changes. Althoughit is desirable to be able to pin hops in an MDT for engineering andtraffic distribution purposes, it cannot be reliably done with a flatmulticast tree with invariant identifiers if there are computed portionsof the MDT.

Further, interactions between the computed and pinned portions of theMDT may cross producing either loops or duplication. Some methods mayreduce but not eliminate the possibility of acyclic trees in thepresence of pinned waypoints as tunnel collisions will not result inlooping or duplication. In all cases however, where there is a mix ofpinned and computed trees there may be problems when a topology changemay result in a single node resolving to being a replication tree formultiple sub trees of the overall tree.

The MDT is implemented in the context and with the use of reservationresource reservation protocol-traffic engineering (RSVP-TE) signaledpoint to multipoint (P2MP) trees. The nodes of the topology label swapon every hop. The loosely specified MDTs are signaled (i.e., there is ahead end, root, computation). Each root of the sub-trees is responsiblefor making the respective sub-tree acyclic. In some embodiments, routingin the MDT is determined via IEEE 802.1aq Shortest Path Bridging, whichprovides some of the thinking and algorithms for the computed paths.IEEE 802.1Qca which permits the specification of MDTs in a link staterouting system or aspects thereof is an exemplar of how loose trees canbe expressed in a link state environment although it is not the onlymethod of expressing a loosely pinned MDT in a control plane.

RSVP-TE has the ability to set up loose p2mp trees, but these are basedon the node at the ingress to a loosely specified hop computing the treeat signaling setup. This can have resilience issues and is unable toleverage some of the optimizations available via some distributedcomputation models. Protocols used for MDT tree establishment are basedon unicast convergence do not have this capability. It would bedesirable to have this capability in combination with some multicastdistribution models. IEEE 802.1Qca has demonstrated that the singleinterior gateway protocol (IGP) model can be extended into explicittrees. But if a distribution model uses a global label per (S,G) tree,which would not be guaranteed to produce an overall acyclic tree whencombined with pinned waypoints. The embodiments provide a solution forthe partitioning of a given MDT into sub-trees, and then separating themin the dataplane via the use of a global label per sub-tree to rendercollisions harmless.

The embodiments overcome the limitations of the prior art by providing aprocess and apparatus where for a given MDT with pinned points that ispartitioned into a set of sub-trees, each of the sub-trees is assigned aglobal identifier such as a global label. As part of MDT computation,the stitching of labels between sub-trees is determined and installed,and each sub-tree computed as if it were a unique S,G tree. Eachsub-tree itself is acyclic as a consequence of the algorithms used. Anycollisions between sub-trees are rendered harmless as each isimplemented as a unique (S,G) tree. The embodiments provide advantagesover the prior art as they permit traffic engineered MDTs to be combinedwith computed MDTs to produce MDTs specified to any level ofgranularity. This can be accomplished using multiprotocol labelswitching (MPLS) technologies with no changes to the technology base.

FIG. 2 is a diagram of one embodiment of a replication tree shared bymultiple sub-trees. This diagram illustrates one of the issues ofchanges in topologies where a single node becomes a replication tree formultiple sub trees. In the diagram, the structure of the topology issimplified for sake of illustration. The root of the loosely defined MDTis connected with a set of sub-trees that include two replicating pointsthat serve as the roots for two sub-trees A and B in subsequent stage ofthe MDT. Each of these sub-trees (A & B), however have come to share areplication node through which all of the leaves of the MDT arereachable. A non-cyclic tree such as this demonstrate that a replicationtree can receive multiple copies of traffic and cannot determine thecorrect set of leaves for each received packet.

FIG. 3 is a diagram of one embodiment of a replication tree shared bymultiple trees where the data traffic is differentiated. The problem ofthe shared replication tree can be resolved by providing a new S, Gidentifier for each pinned point (i.e., for each sub-tree) in the MDTand translating the received S,G identifier to the new identifier ateach replication node. Any individual sub-tree between pinnedreplication nodes and a set of leaves can be guaranteed to be acyclicand therefore have no replication node in common. However, the problemis when sub-trees that share a common root sub tree cross over; using adistinct identifier allows them to be given separate treatment. Anon-acyclic sub-tree means a replication node can receive multiplecopies and cannot determine the correct set of leaves for each whichresults in duplication of delivery to individual leaves or worse. ForMPLS technologies this means each sub-tree root gets its own label foran S, G tree, so even if sub-trees do collide they are treated asseparate S,G trees by the replication node.

As mentioned herein above, as a result of the use of separate S, Glabels for each sub-tree each sub-tree label need to be known networkwide. As a consequence of arbitrary topology change, any node in thenetwork may need to install state for a given sub-tree. An IGP floodedor signaled tree descriptor which indicates the hierarchy of subtrees inan individual MDT and would augment the normal group membershipindications advertised in the distributed control plane.

The operations in the flow diagrams will be described with reference tothe exemplary embodiments of the other figures. However, it should beunderstood that the operations of the flow diagrams can be performed byembodiments of the invention other than those discussed with referenceto the other figures, and the embodiments of the invention discussedwith reference to these other figures can perform operations differentthan those discussed with reference to the flow diagrams.

FIG. 4 is a diagram of one embodiment of the process for computing thesub-trees. In one embodiment, this process may be performed upon thechange in the topology of the network, change in MDT membership,initiation of a MDT or similar circumstances.

Generally, a computing node selects a node in the network or a node in aloosely specified MDT. For each subtree rooted on the selected node, thecomputing node performs the following steps:

1) If the root for a given subtree has failed, or the root of any leafsubtrees has failed, the computing node adjusts the roots and leaves ofthe MDT accordingly before further processing to produce a superset ofthe two subtrees affected by the failure.

2) The computing node computes the complete MDT for each subtree rootedon the selected node.

3) If the computing node determines that it needs to install state foreach subtree it does so.

4) If the computing node determines that it is a subtree root, itinstalls state to connect the downstream subtree(s) to the upstreamsubtree.

In reference to FIG. 4, an example embodiment of the process isdescribed. The process may start with a previously computed or definedloosely specified MDT (Block 401). In addition, sub-tree descriptors anda hierarchical relationship of the sub-trees are communicated by arouting protocol of a distributed routing system between the nodes ofthe system. This information can then be utilized as part of the processfor identifying sub-tree relationships and root nodes.

The process proceeds by selecting a first node, referred to as thecurrent node, from the set of nodes in the network or in the looselyspecified MDT (Block 403). Then the process selects a sub-tree in theset of sub-trees in the loosely specified MDT that is rooted at thecurrent node (Block 405). Any number of sub-trees may be rooted at anygiven node.

A check is then made whether any leaves of the sub-trees or of theselected sub-tree are roots that have failed (Block 407). If there areroots that have failed then the process merges the sub-trees that areaffected both the immediate upstream and downstream sub-trees are mergedwhere the root has failed (Block 411). In other words, the sub-treeswith leafs that are the failed roots are merged with the correspondingsub-trees with the failed roots.

After the merging process has completed or if there are no failed roots,then the process computes the complete MDT for the current sub-tree fromthe root to each of the leaves of the sub-tree (Block 409). Once thecomplete MDT has been computed for the selected sub-tree, a check ismade whether the computing node is the current node (Block 413). If so,then the process checks whether there is an upstream sub-tree for thecurrent node/computing node (Block 415). If there is an upstreamsub-tree then the process generates a translation of sub-treeidentifiers between the sub-tree identifiers of the selected sub-treeand a sub-tree identifier of an upstream sub-tree (Block 417). In someembodiments, the sub-tree identifiers are labels and the process crossconnects the labels of the sub-trees (i.e., of the upstream anddownstream sub-trees).

If there is no upstream sub-tree or after the cross connect, the processcontinues to check whether the computing node needs to install state forthe selected sub-tree (Block 419). If the computing node does need toinstall state for the selected sub-tree, then the process installs thestate (Block 421) for the computing node. This may entail installing thestate to receive traffic from the upstream sub-tree root. If not, stateneeds to be installed or after the state has been installed, then acheck is made whether additional sub-trees rooted at the selected noderemain to be processed (Block 423). If so, then the process continues beselected the next sub-tree (Block 405). If there not additionalsub-trees, then the process checks whether there are additional nodes inthe loosely specified MDT or the network to be processed (Block 425). Ifthere are additional nodes to process, then a next ‘current’ node isselected (Block 403). Otherwise the process completes.

In one example embodiment, this process may described through pseudocodeas set forth below:

Pseudo code   Start /* construct multicast FIB : performed by computingnode */   For each node in network → current node   First sub-tree MDTrooted on current node   While MDTs rooted on current node not yetcomputed     Compute sub-tree for MDT sub-tree root to sub-tree leaves     Compute full tree      if a leaf is a sub-tree root that hasfailed, merge leaves of that sub-tree with current sub-tree root set     tie break using whatever tie breaking (independent of P47658 or47758) for the set of leaves for the sub-tree     If computing node isnon sub-tree-root and a replication node     then      installappropriate state to replicate to leaves and replication      trees    endif     if computing node is also current sub-tree root     install appropriate state to replicate to leaves and replication     trees      If upstream state for overall tree already present     cross connect sub-tree labels      endif     endif     if computingnode is leaf on the current sub-tree      install appropriate state toreceive from upstream sub-tree root      If computing node is a sub-treeroot      cross connect sub-tree labels       endif     endif     nextMDT   End while   Next node   End for

FIG. 5 is a diagram of one embodiment of the network and MDT thatillustrates how the process handles the failure of a sub-tree root. Theleft hand side illustrates a MDT in which the node that serves as theroot of a stage two sub-tree has failed. As described above, thisresults in the merger of the sub-tree that has the failed node with thesub-tree where that same node is a replicating node. This merger isperformed before the calculation of the complete sub-tree. The righthand side of the illustration shows that the MDT after the merger, wherethe merged sub-tree encompasses all of the nodes of the two constituentsub-trees. After the merger the MDT encompasses the same nodes thatservice the same leaves and same root. The merged sub-tree uses the S,Gidentifier of the of the upstream subtree (which inherited the leaves ofthe subtree with the failed root) as this will result in a minimum ofchurn in the overall network.

Thus, the computation of the merged sub-trees assumes the stages oneither side of the failed sub-tree root are merged, so a single rootsimply serves a larger constellation of listeners (either sub-tree rootsfor the next stage or leaves). The upstream root and intermediatereplication nodes add state to serve new set of leaves. Leaves add stateto accept data from a different root.

Thus, the embodiments provide a number of advantages over the prior art.The concept that loose hops in an MDT with pinned transit points can beindependently computed is an advance over the prior art. Treating eachloose hop as an independent tree and stitching them together is anadvance over the prior art. Modelling each sub-tree as an independenttree identifier-wise is also an advance over the art. The allocation ofa global per-sub-tree identifier (e.g., a global label) is an advanceover the prior art. This permits independent computation of replicationtrees within each sub-tree. Similarly, the combination of these elementsprovides the advantages defined herein.

FIG. 6 is a diagram of one embodiment of the network device. In oneembodiment, the determination and configuration of quick change IPchannels is implemented by a network device 601 or similar computingdevice. The network device 601 can have any structure that enables it toreceive data traffic (e.g., multicast data traffic) and forward ittoward its destination. The network device 601 can include a networkprocessor 603 or set of network processors that execute the functions ofthe network device 601. A ‘set,’ as used herein, is any positive wholenumber of items including one item. The network device 601 can executesub-tree computation modules 607 to implement the functions ofconfiguring the network for proper handling of quick change IP channelsforwarding of data packets across networks where the network device 601functions as a node in this network as described herein above via anetwork processor 603.

The network device 601 connects with separately administered networksthat have user equipment and/or content servers. The network processor603 can implement the sub-tree computation module(s) 607 as a discretehardware, software module or any combination thereof. The networkprocessor 603 can also service the routing information base 605A andsimilar functions related to data traffic forwarding and networktopology maintenance. The routing information base 605A can beimplemented as match action tables that are utilized for forwardingprotocol data units PDUs (i.e. packets). The functions of the sub-treecomputation module(s) 607 can be implemented as modules in anycombination of software, including firmware, and hardware within thenetwork device. The functions of the multicast management module(s) 607that are executed and implemented by the network device 601 includethose described further herein above.

In one embodiment, the network device 601 can include a set of linecards 617 that process and forward the incoming data traffic toward therespective destination nodes by identifying the destination andforwarding the data traffic to the appropriate line card 617 having anegress port that leads to or toward the destination via a next hop.These line cards 617 can also implement the forwarding information baseand/label forwarding base 605B, or a relevant subset thereof. The linecards 617 can also implement or facilitate the multicast managementmodule(s) 307 functions described herein above. The line cards 617 arein communication with one another via a switch fabric 611 andcommunicate with other nodes over attached networks 621 using Ethernet,fiber optic or similar communication links and media.

FIG. 7A illustrates connectivity between network devices (NDs) within anexemplary network, as well as three exemplary implementations of theNDs, according to some embodiments of the invention. FIG. 7A shows NDs700A-H, and their connectivity by way of lines between A-B, B-C, C-D,D-E, E-F, F-G, and A-G, as well as between H and each of A, C, D, and G.These NDs are physical devices, and the connectivity between these NDscan be wireless or wired (often referred to as a link). An additionalline extending from NDs 700A, E, and F illustrates that these NDs act asingress and egress points for the network (and thus, these NDs aresometimes referred to as edge NDs; while the other NDs may be calledcore NDs).

Two of the exemplary ND implementations in FIG. 7A are: 1) aspecial-purpose network device 702 that uses custom application—specificintegrated—circuits (ASICs) and a proprietary operating system (OS); and2) a general purpose network device 704 that uses common off-the-shelf(COTS) processors and a standard OS.

The special-purpose network device 702 includes networking hardware 710comprising compute resource(s) 712 (which typically include a set of oneor more processors), forwarding resource(s) 714 (which typically includeone or more ASICs and/or network processors), and physical networkinterfaces (NIs) 716 (sometimes called physical ports), as well asnon-transitory machine readable storage media 718 having stored thereinnetworking software 720. A physical NI is hardware in a ND through whicha network connection (e.g., wirelessly through a wireless networkinterface controller (WNIC) or through plugging in a cable to a physicalport connected to a network interface controller (NIC)) is made, such asthose shown by the connectivity between NDs 700A-H. During operation,the networking software 720 may be executed by the networking hardware710 to instantiate a set of one or more networking software instance(s)722. Each of the networking software instance(s) 722, and that part ofthe networking hardware 710 that executes that network software instance(be it hardware dedicated to that networking software instance and/ortime slices of hardware temporally shared by that networking softwareinstance with others of the networking software instance(s) 722), form aseparate virtual network element 730A-R. Each of the virtual networkelement(s) (VNEs) 730A-R includes a control communication andconfiguration module 732A-R (sometimes referred to as a local controlmodule or control communication module) and forwarding table(s) 734A-R,such that a given virtual network element (e.g., 730A) includes thecontrol communication and configuration module (e.g., 732A), a set ofone or more forwarding table(s) (e.g., 734A), and that portion of thenetworking hardware 710 that executes the virtual network element (e.g.,730A).

Software 720 can include code which when executed by networking hardware710, causes networking hardware 710 to perform operations of one or moreembodiments of the present invention as part networking softwareinstances 722. The software 720 includes the sub-tree computation module764A.

The special-purpose network device 702 is often physically and/orlogically considered to include: 1) a ND control plane 724 (sometimesreferred to as a control plane) comprising the compute resource(s) 712that execute the control communication and configuration module(s)732A-R; and 2) a ND forwarding plane 726 (sometimes referred to as aforwarding plane, a data plane, or a media plane) comprising theforwarding resource(s) 714 that utilize the forwarding table(s) 734A-Rand the physical NIs 716. By way of example, where the ND is a router(or is implementing routing functionality), the ND control plane 724(the compute resource(s) 712 executing the control communication andconfiguration module(s) 732A-R) is typically responsible forparticipating in controlling how data (e.g., packets) is to be routed(e.g., the next hop for the data and the outgoing physical NI for thatdata) and storing that routing information in the forwarding table(s)734A-R, and the ND forwarding plane 726 is responsible for receivingthat data on the physical NIs 716 and forwarding that data out theappropriate ones of the physical NIs 716 based on the forwardingtable(s) 734A-R.

FIG. 7B illustrates an exemplary way to implement the special-purposenetwork device 702 according to some embodiments of the invention. FIG.7B shows a special-purpose network device including cards 738 (typicallyhot pluggable). While in some embodiments the cards 738 are of two types(one or more that operate as the ND forwarding plane 726 (sometimescalled line cards), and one or more that operate to implement the NDcontrol plane 724 (sometimes called control cards)), alternativeembodiments may combine functionality onto a single card and/or includeadditional card types (e.g., one additional type of card is called aservice card, resource card, or multi-application card). A service cardcan provide specialized processing (e.g., Layer 4 to Layer 7 services(e.g., firewall, Internet Protocol Security (IPsec), Secure SocketsLayer (SSL)/Transport Layer Security (TLS), Intrusion Detection System(IDS), peer-to-peer (P2P), Voice over IP (VoIP) Session BorderController, Mobile Wireless Gateways (Gateway General Packet RadioService (GPRS) Support Node (GGSN), Evolved Packet Core (EPC) Gateway)).By way of example, a service card may be used to terminate IPsec tunnelsand execute the attendant authentication and encryption algorithms.These cards are coupled together through one or more interconnectmechanisms illustrated as backplane 736 (e.g., a first full meshcoupling the line cards and a second full mesh coupling all of thecards).

Returning to FIG. 7A, the general purpose network device 704 includeshardware 740 comprising a set of one or more processor(s) 742 (which areoften COTS processors) and network interface controller(s) 744 (NICs;also known as network interface cards) (which include physical NIs 746),as well as non-transitory machine readable storage media 748 havingstored therein software 750. During operation, the processor(s) 742execute the software 750 to instantiate one or more sets of one or moreapplications 764A-R. While one embodiment does not implementvirtualization, alternative embodiments may use different forms ofvirtualization—represented by a virtualization layer 754 and softwarecontainers 762A-R. For example, one such alternative embodimentimplements operating system-level virtualization, in which case thevirtualization layer 754 represents the kernel of an operating system(or a shim executing on a base operating system) that allows for thecreation of multiple software containers 762A-R that may each be used toexecute one of the sets of applications 764A-R. In this embodiment, themultiple software containers 762A-R (also called virtualization engines,virtual private servers, or jails) are each a user space instance(typically a virtual memory space) these user space instances areseparate from each other and separate from the kernel space in which theoperating system is run; die set of applications running in a given userspace, unless explicitly allowed, cannot access the memory of the otherprocesses. Another such alternative embodiment implements fullvirtualization, in which case: 1) the virtualization layer 754represents a hypervisor (sometimes referred to as a virtual machinemonitor (VMM)) or a hypervisor executing on top of a host operatingsystem; and 2) the software containers 762A-R each represent a tightlyisolated form of software container called a virtual machine that is runby the hypervisor and may include a guest operating system. A virtualmachine is a software implementation of a physical machine that runsprograms as if they were executing on a physical, non-virtualizedmachine; and applications generally do not know they are running on avirtual machine as opposed to running on a “bare metal” host electronicdevice, though some systems provide para-virtualization which allows anoperating system or application to be aware of the presence ofvirtualization for optimization purposes.

The instantiation of the one or more sets of one or more applications764A-R, as well as the virtualization layer 754 and software containers762A-R if implemented, are collectively referred to as softwareinstance(s) 752. Each set of applications 764A-R, corresponding softwarecontainer 762A-R if implemented, and that part of the hardware 740 thatexecutes them (be it hardware dedicated to that execution and/or timeslices of hardware temporally shared by software containers 762A-R),forms a separate virtual network element(s) 760A-R.

The virtual network element(s) 760A-R perform similar functionality tothe virtual network element(s) 730A-R—e.g., similar to the controlcommunication and configuration module(s) 732A and forwarding table(s)734A (this virtualization of the hardware 740 is sometimes referred toas network function virtualization (NFV)). Thus, NFV may be used toconsolidate many network equipment types onto industry standard highvolume server hardware, physical switches, and physical storage, whichcould be located in Data centers, NDs, and customer premise equipment(CPE). However, different embodiments of the invention may implement oneor more of the software container(s) 762A-R differently. For example,while embodiments of the invention are illustrated with each softwarecontainer 762A-R corresponding to one VNE 760A-R, alternativeembodiments may implement this correspondence at a finer levelgranularity (e.g., line card virtual machines virtualize line cards,control card virtual machine virtualize control cards, etc.); it shouldbe understood that the techniques described herein with reference to acorrespondence of software containers 762A-R to VNEs also apply toembodiments where such a finer level of granularity is used.

In certain embodiments, the virtualization layer 754 includes a virtualswitch that provides similar forwarding services as a physical Ethernetswitch. Specifically, this virtual switch forwards traffic betweensoftware containers 762A-R and the NIC(s) 744, as well as optionallybetween the software containers 762A-R; in addition, this virtual switchmay enforce network isolation between the VNEs 760A-R that by policy arenot permitted to communicate with each other (e.g., by honoring virtuallocal area networks (VLANs)).

Software 750 can include code, which when executed by processor(s) 742,causes processor(s) 742 to perform operations of one or more embodimentsof the present invention as part software containers 762A-R. Thesoftware 750 can include the sub-tree computation module 764A.

The third exemplary ND implementation in FIG. 7A is a hybrid networkdevice 706, which includes both custom ASICs/proprietary OS and COTSprocessors/standard OS in a single ND or a single card within an ND. Incertain embodiments of such a hybrid network device, a platform VM(i.e., a VM that that implements the functionality of thespecial-purpose network device 702) could provide forpara-virtualization to the networking hardware present in the hybridnetwork device 706.

Regardless of the above exemplary implementations of an ND, when asingle one of multiple VNEs implemented by an ND is being considered(e.g., only one of the VNEs is part of a given virtual network) or whereonly a single VNE is currently being implemented by an ND, the shortenedterm network element (NE) is sometimes used to refer to that VNE. Alsoin all of the above exemplary implementations, each of the VNEs (e.g.,VNE(s) 730A-R, VNEs 760A-R, and those in the hybrid network device 706)receives data on the physical NIs (e.g., 716, 746) and forwards thatdata out the appropriate ones of the physical NIs (e.g., 716, 746). Forexample, a VNE implementing IP router functionality forwards IP packetson the basis of some of the IP header information in the IP packet;where IP header information includes source IP address, destination IPaddress, source port, destination port (where “source port” and“destination port” refer herein to protocol ports, as opposed tophysical ports of a ND), transport protocol (e.g., user datagramprotocol (UDP), Transmission Control Protocol (TCP), and differentiatedservices (DSCP) values.

FIG. 7C illustrates various exemplary ways in which VNEs may be coupledaccording to some embodiments of the invention. FIG. 7C shows VNEs770A.1-770A.P (and optionally VNEs 770A.Q-770A.R) implemented in ND 700Aand VNE 770H.1 in ND 700H. In FIG. 7C, VNEs 770A.1-P are separate fromeach other in the sense that they can receive packets from outside ND700A and forward packets outside of ND 700A; VNE 770A.1 is coupled withVNE 770H.1, and thus they communicate packets between their respectiveNDs; VNE 770A.2-770A.3 may optionally forward packets between themselveswithout forwarding them outside of the ND 700A; and VNE 770A.P mayoptionally be the first in a chain of VNEs that includes VNE 770A.Qfollowed by VNE 770A.R (this is sometimes referred to as dynamic servicechaining, where each of the VNEs in the series of VNEs provides adifferent service—e.g., one or more layer 4-7 network services). WhileFIG. 7C illustrates various exemplary relationships between the VNEs,alternative embodiments may support other relationships (e.g.,more/fewer VNEs, more/fewer dynamic service chains, multiple differentdynamic service chains with some common VNEs and some different VNEs).

The NDs of FIG. 7A, for example, may form part of the Internet or aprivate network; and other electronic devices (not shown; such as enduser devices including workstations, laptops, netbooks, tablets, palmtops, mobile phones, smartphones, phablets, multimedia phones, VoiceOver Internet Protocol (VOIP) phones, terminals, portable media players,GPS units, wearable devices, gaming systems, set-top boxes, Internetenabled household appliances) may be coupled to the network (directly orthrough other networks such as access networks) to communicate over thenetwork (e.g., the Internet or virtual private networks (VPNs) overlaidon (e.g., tunneled through) the Internet) with each other (directly orthrough servers) and/or access content and/or services. Such contentand/or services are typically provided by one or more servers (notshown) belonging to a service/content provider or one or more end userdevices (not shown) participating in a peer-to-peer (P2P) service, andmay include, for example, public webpages (e.g., free content, storefronts, search services), private webpages (e.g., username/passwordaccessed webpages providing email services), and/or corporate networksover VPNs. For instance, end user devices may be coupled (e.g., throughcustomer premise equipment coupled to an access network (wired orwirelessly)) to edge NDs, which are coupled (e.g., through one or morecore NDs) to other edge NDs, which are coupled to electronic devicesacting as servers. However, through compute and storage virtualization,one or more of the electronic devices operating as the NDs in FIG. 7Amay also host one or more such servers (e.g., in the case of the generalpurpose network device 704, one or more of the software containers762A-R may operate as servers; the same would be true for the hybridnetwork device 706; in the case of the special-purpose network device702, one or more such servers could also be run on a virtualizationlayer executed by the compute resource(s) 712); in which case theservers are said to be co-located with the VNEs of that ND.

A virtual network is a logical abstraction of a physical network (suchas that in FIG. 7A) that provides network services (e.g., L2 and/or L3services). A virtual network can be implemented as an overlay network(sometimes referred to as a network virtualization overlay) thatprovides network services (e.g., layer 2 (L2, data link layer) and/orlayer 3 (L3, network layer) services) over an underlay network (e.g., anL3 network, such as an Internet Protocol (IP) network that uses tunnels(e.g., generic routing encapsulation (GRE), layer 2 tunneling protocol(L2TP), IPSec) to create the overlay network).

A network virtualization edge (NVE) sits at the edge of the underlaynetwork and participates in implementing the network virtualization; thenetwork-facing side of the NVE uses the underlay network to tunnelframes to and from other NVEs; the outward-facing side of the NVE sendsand receives data to and from systems outside the network. A virtualnetwork instance (VNI) is a specific instance of a virtual network on aNVE (e.g., a NE/VNE on an ND, a part of a NE/VNE on a ND where thatNE/VNE is divided into multiple VNEs through emulation); one or moreVNIs can be instantiated on an NVE (e.g., as different VNEs on an ND). Avirtual access point (VAP) is a logical connection point on the NVE forconnecting external systems to a virtual network; a VAP can be physicalor virtual ports identified through logical interface identifiers (e.g.,a VLAN ID).

Examples of network services include: 1) an Ethernet LAN emulationservice (an Ethernet-based multipoint service similar to an InternetEngineering Task Force (IETF) Multiprotocol Label Switching (MPLS) orEthernet VPN (EVPN) service) in which external systems areinterconnected across the network by a LAN environment over the underlaynetwork (e.g., an NVE provides separate L2 VNIs (virtual switchinginstances) for different such virtual networks, and L3 (e.g., IP/MPLS)tunneling encapsulation across the underlay network); and 2) avirtualized IP forwarding service (similar to IETF IP VPN (e.g., BorderGateway Protocol (BGP)/MPLS IPVPN) from a service definitionperspective) in which external systems are interconnected across thenetwork by an L3 environment over the underlay network (e.g., an NVEprovides separate L3 VNIs (forwarding and routing instances) fordifferent such virtual networks, and L3 (e.g., IP/MPLS) tunnelingencapsulation across the underlay network)). Network services may alsoinclude quality of service capabilities (e.g., traffic classificationmarking, traffic conditioning and scheduling), security capabilities(e.g., filters to protect customer premises from network—originatedattacks, to avoid malformed route announcements), and managementcapabilities (e.g., full detection and processing).

FIG. 7D illustrates a network with a single network element on each ofthe NDs of FIG. 7A, and within this straight forward approach contrastsa traditional distributed approach (commonly used by traditionalrouters) with a centralized approach for maintaining reachability andforwarding information (also called network control), according to someembodiments of the invention. Specifically, FIG. 7D illustrates networkelements (NEs) 770A-H with the same connectivity as the NDs 700A-H ofFIG. 7A.

FIG. 7D illustrates that the distributed approach 772 distributesresponsibility for generating the reachability and forwardinginformation across the NEs 770A-H; in other words, the process ofneighbor discovery and topology discovery is distributed.

For example, where the special-purpose network device 702 is used, thecontrol communication and configuration module(s) 732A-R of the NDcontrol plane 724 typically include a reachability and forwardinginformation module to implement one or more routing protocols (e.g., anexterior gateway protocol such as Border Gateway Protocol (BGP),Interior Gateway Protocol(s) (IGP) (e.g., Open Shortest Path First(OSPF), Intermediate System to Intermediate System (IS-IS), RoutingInformation Protocol (RIP)), Label Distribution Protocol (LDP), ResourceReservation Protocol (RSVP), as well as RSVP-Traffic Engineering (TE):Extensions to RSVP for LSP Tunnels, Generalized Multi-Protocol LabelSwitching (GMPLS) Signaling RSVP-TE that communicate with other NEs toexchange routes, and then selects those routes based on one or morerouting metrics. Thus, the NEs 770A-H (e.g., the compute resource(s) 712executing the control communication and configuration module(s) 732A-R)perform their responsibility for participating in controlling how data(e.g., packets) is to be routed (e.g., the next hop for the data and theoutgoing physical NI for that data) by distributively determining thereachability within the network and calculating their respectiveforwarding information. Routes and adjacencies are stored in one or morerouting structures (e.g., Routing Information Base (RIB), LabelInformation Base (LIB), one or more adjacency structures) on the NDcontrol plane 724. The ND control plane 724 programs the ND forwardingplane 726 with information (e.g., adjacency and route information) basedon the routing structure(s). For example, the ND control plane 724programs the adjacency and route information into one or more forwardingtable(s) 734A-R (e.g., Forwarding Information Base (FIB), LabelForwarding Information Base (LFIB), and one or more adjacencystructures) on the ND forwarding plane 726. For layer 2 forwarding, theND can store one or more bridging tables that are used to forward databased on the layer 2 information in that data. While the above exampleuses the special-purpose network device 702, the same distributedapproach 772 can be implemented on the general purpose network device704 and the hybrid network device 706.

FIG. 7D illustrates that a centralized approach 774 (also known assoftware defined networking (SDN)) that decouples the system that makesdecisions about where traffic is sent from the underlying systems thatforwards traffic to the selected destination. The illustratedcentralized approach 774 has the responsibility for the generation ofreachability and forwarding information in a centralized control plane776 (sometimes referred to as a SDN control module, controller, networkcontroller, OpenFlow controller, SDN controller, control plane node,network virtualization authority, or management control entity), andthus the process of neighbor discovery and topology discovery iscentralized. The centralized control plane 776 has a south boundinterface 782 with a data plane 780 (sometime referred to theinfrastructure layer, network forwarding plane, or forwarding plane(which should not be confused with a ND forwarding plane)) that includesthe NEs 770A-H (sometimes referred to as switches, forwarding elements,data plane elements, or nodes). The centralized control plane 776includes a network controller 778, which includes a centralizedreachability and forwarding information module 779 that determines thereachability within the network and distributes the forwardinginformation to the NEs 770A-H of the data plane 780 over the south boundinterface 782 (which may use the OpenFlow protocol). Thus, the networkintelligence is centralized in the centralized control plane 776executing on electronic devices that are typically separate from theNDs.

For example, where the special-purpose network device 702 is used in thedata plane 780, each of the control communication and configurationmodule(s) 732A-R of the ND control plane 724 typically include a controlagent that provides the VNE side of the south bound interface 782. Inthis case, the ND control plane 724 (the compute resource(s) 712executing the control communication and configuration module(s) 732A-R)performs its responsibility for participating in controlling how data(e.g., packets) is to be routed (e.g., the next hop for the data and theoutgoing physical NI for that data) through the control agentcommunicating with the centralized control plane 776 to receive theforwarding information (and in some cases, the reachability information)from the centralized reachability and forwarding information module 779(it should be understood that in some embodiments of the invention, thecontrol communication and configuration module(s) 732A-R, in addition tocommunicating with the centralized control plane 776, may also play somerole in determining reachability and/or calculating forwardinginformation—albeit less so than in the case of a distributed approach;such embodiments are generally considered to fall under the centralizedapproach 774, but may also be considered a hybrid approach).

In some embodiments, the sub-tree computation module 781 is implementedas part of the centralized reachability and forwarding informationmodule 779, as part of the applications 788 in the application layer 786or as part of a similar component of the centralized control plane 776or application layer 786. This can be in conjunction with a centralizedmodule that implements the programming of unicast forwarding, or used asan adjunct to unicast forwarding programmed by a distributed routingsystem.

While the above example uses the special-purpose network device 702, thesame centralized approach 774 can be implemented with the generalpurpose network device 704 (e.g., each of the VNE 760A-R performs itsresponsibility for controlling how data (e.g., packets) is to be routed(e.g., the next hop for the data and the outgoing physical NI for thatdata) by communicating with the centralized control plane 776 to receivethe forwarding information (and in some cases, the reachabilityinformation) from the centralized reachability and forwardinginformation module 779; it should be understood that in some embodimentsof the invention, the VNEs 760A-R, in addition to communicating with thecentralized control plane 776, may also play some role in determiningreachability and/or calculating forwarding information—albeit less sothan in the case of a distributed approach) and the hybrid networkdevice 706. In fact, the use of SDN techniques can enhance the NFVtechniques typically used in the general purpose network device 704 orhybrid network device 706 implementations as NFV is able to support SDNby providing an infrastructure upon which the SDN software can be run,and NFV and SDN both aim to make use of commodity server hardware andphysical switches.

FIG. 7D also shows that the centralized control plane 776 has a northbound interface 784 to an application layer 786, in which residesapplication(s) 788. The centralized control plane 776 has the ability toform virtual networks 792 (sometimes referred to as a logical forwardingplane, network services, or overlay networks (with the NEs 770A-H of thedata plane 780 being the underlay network)) for the application(s) 788.Thus, the centralized control plane 776 maintains a global view of allNDs and configured NEs/VNEs, and it maps the virtual networks to theunderlying NDs efficiently (including maintaining these mappings as thephysical network changes either through hardware (ND, link, or NDcomponent) failure, addition, or removal).

While FIG. 7D shows the distributed approach 772 separate from thecentralized approach 774, the effort of network control may bedistributed differently or the two combined in certain embodiments ofthe invention. For example: 1) embodiments may generally use thecentralized approach (SDN) 774, but have certain functions delegated tothe NEs (e.g., the distributed approach may be used to implement one ormore of fault monitoring, performance monitoring, protection switching,and primitives for neighbor and/or topology discovery); or 2)embodiments of the invention may perform neighbor discovery and topologydiscovery via both the centralized control plane and the distributedprotocols, and the results compared to raise exceptions where they donot agree. Such embodiments are generally considered to fall under thecentralized approach 774, but may also be considered a hybrid approach.

While FIG. 7D illustrates the simple case where each of the NDs 700A-Himplements a single NE 770A-H, it should be understood that the networkcontrol approaches described with reference to FIG. 7D also work fornetworks where one or more of the NDs 700A-H implement multiple VNEs(e.g., VNEs 730A-R, VNEs 760A-R, those in the hybrid network device706). Alternatively or in addition, the network controller 778 may alsoemulate the implementation of multiple VNEs in a single ND.Specifically, instead of (or in addition to) implementing multiple VNEsin a single ND, the network controller 778 may present theimplementation of a VNE/NE in a single ND as multiple VNEs in thevirtual networks 792 (all in the same one of the virtual network(s) 792,each in different ones of the virtual network(s) 792, or somecombination). For example, the network controller 778 may cause an ND toimplement a single VNE (a NE) in the underlay network, and thenlogically divide up the resources of that NE within the centralizedcontrol plane 776 to present different VNEs in the virtual network(s)792 (where these different VNEs in the overlay networks are sharing theresources of the single VNE/NE implementation on the ND in the underlaynetwork).

On the other hand, FIGS. 7E and 7F respectively illustrate exemplaryabstractions of NEs and VNEs that the network controller 778 may presentas part of different ones of the virtual networks 792. FIG. 7Eillustrates the simple case of where each of the NDs 700A-H implements asingle NE 770A-H (see FIG. 7D), but the centralized control plane 776has abstracted multiple of the NEs in different NDs (the NEs 770A-C andG-H) into (to represent) a single NE 770I in one of the virtualnetwork(s) 792 of FIG. 7D, according to some embodiments of theinvention. FIG. 7E shows that in this virtual network, the NE 770I iscoupled to NE 770D and 770F, which are both still coupled to NE 770E.

FIG. 7F illustrates a case where multiple VNEs (VNE 770A.1 and VNE770H.1) are implemented on different NDs (ND 700A and ND 700H) and arecoupled to each other, and where the centralized control plane 776 hasabstracted these multiple VNEs such that they appear as a single VNE770T within one of the virtual networks 792 of FIG. 7D, according tosome embodiments of the invention. Thus, the abstraction of a NE or VNEcan span multiple NDs.

While some embodiments of the invention implement the centralizedcontrol plane 776 as a single entity (e.g., a single instance ofsoftware running on a single electronic device), alternative embodimentsmay spread the functionality across multiple entities for redundancyand/or scalability purposes (e.g., multiple instances of softwarerunning on different electronic devices).

Similar to the network device implementations, the electronic device(s)running the centralized control plane 776, and thus the networkcontroller 778 including the centralized reachability and forwardinginformation module 779, may be implemented a variety of ways (e.g., aspecial purpose device, a general-purpose (e.g., COTS) device, or hybriddevice). These electronic device(s) would similarly include computeresource(s), a set or one or more physical NICs, and a non-transitorymachine-readable storage medium having stored thereon the centralizedcontrol plane software. For instance, FIG. 8 illustrates, a generalpurpose control plane device 804 including hardware 840 comprising a setof one or more processor(s) 842 (which are often COTS processors) andnetwork interface controller(s) 844 (NICs; also known as networkinterface cards) (which include physical NIs 846), as well asnon-transitory machine readable storage media 848 having stored thereincentralized control plane (CCP) software 850.

In embodiments that use compute virtualization, the processor(s) 842typically execute software to instantiate a virtualization layer 854 andsoftware container(s) 862A-R (e.g., with operating system-levelvirtualization, the virtualization layer 854 represents the kernel of anoperating system (or a shim executing on a base operating system) thatallows for the creation of multiple software containers 862A-R(representing separate user space instances and also calledvirtualization engines, virtual private servers, or jails) that may eachbe used to execute a set of one or more applications; with fullvirtualization, the virtualization layer 854 represents a hypervisor(sometimes referred to as a virtual machine monitor (VMM)) or ahypervisor executing on top of a host operating system, and the softwarecontainers 862A-R each represent a tightly isolated form of softwarecontainer called a virtual machine that is run by the hypervisor and mayinclude a guest operating system; with para-virtualization, an operatingsystem or application running with a virtual machine may be aware of thepresence of virtualization for optimization purposes). Again, inembodiments where compute virtualization is used, during operation aninstance of the CCP software 850 (illustrated as CCP instance 876A) isexecuted within the software container 862A on the virtualization layer854. In embodiments where compute virtualization is not used, the CCPinstance 876A on top of a host operating system is executed on the “baremetal” general purpose control plane device 804. The instantiation ofthe CCP instance 876A, as well as the virtualization layer 854 andsoftware containers 862A-R if implemented, are collectively referred toas software instance(s) 852.

In some embodiments, the CCP instance 876A includes a network controllerinstance 878. The network controller instance 878 includes a centralizedreachability and forwarding information module instance 879 (which is amiddleware layer providing the context of the network controller 778 tothe operating system and communicating with the various NEs), and an CCPapplication layer 880 (sometimes referred to as an application layer)over the middleware layer (providing the intelligence required forvarious network operations such as protocols, network situationalawareness, and user—interfaces). At a more abstract level, this CCPapplication layer 880 within the centralized control plane 776 workswith virtual network view(s) (logical view(s) of the network) and themiddleware layer provides the conversion from the virtual networks tothe physical view.

The centralized control plane 776 transmits relevant messages to thedata plane 780 based on CCP application layer 880 calculations andmiddleware layer mapping for each flow. A flow may be defined as a setof packets whose headers match a given pattern of bits; in this sense,traditional IP forwarding is also flow-based forwarding where the flowsare defined by the destination IP address for example; however, in otherimplementations, the given pattern of bits used for a flow definitionmay include more fields (e.g., 10 or more) in the packet headers.Different NDs/NEs/VNEs of the data plane 780 may receive differentmessages, and thus different forwarding information. The data plane 780processes these messages and programs the appropriate flow informationand corresponding actions in the forwarding tables (sometime referred toas flow tables) of the appropriate NE/VNEs, and then the NEs/VNEs mapincoming packets to flows represented in the forwarding tables andforward packets based on the matches in the forwarding tables.

In some embodiments, the sub-tree computation module 881 is implementedas part of the centralized reachability and forwarding informationmodule 879, as part of the applications in the application layer 880 oras part of a similar component of the centralized control plane device804.

Standards such as OpenFlow define the protocols used for the messages,as well as a model for processing the packets. The model for processingpackets includes header parsing, packet classification, and makingforwarding decisions. Header parsing describes how to interpret a packetbased upon a well-known set of protocols. Some protocol fields are usedto build a match structure (or key) that will be used in packetclassification (e.g., a first key field could be a source media accesscontrol (MAC) address, and a second key field could be a destination MACaddress).

Packet classification involves executing a lookup in memory to classifythe packet by determining which entry (also referred to as a forwardingtable entry or flow entry) in the forwarding tables best matches thepacket based upon the match structure, or key, of the forwarding tableentries. It is possible that many flows represented in the forwardingtable entries can correspond/match to a packet; in this case the systemis typically configured to determine one forwarding table entry from themany according to a defined scheme (e.g., selecting a first forwardingtable entry that is matched). Forwarding table entries include both aspecific set of match criteria (a set of values or wildcards, or anindication of what portions of a packet should be compared to aparticular value/values/wildcards, as defined by the matchingcapabilities—for specific fields in the packet header, or for some otherpacket content), and a set of one or more actions for the data plane totake on receiving a matching packet. For example, an action may be topush a header onto the packet, for the packet using a particular port,flood the packet, or simply drop the packet. Thus, a forwarding tableentry for IPv4/IPv6 packets with a particular transmission controlprotocol (TCP) destination port could contain an action specifying thatthese packets should be dropped.

Making forwarding decisions and performing actions occurs, based uponthe forwarding table entry identified during packet classification, byexecuting the set of actions identified in the matched forwarding tableentry on the packet.

However, when an unknown packet (for example, a “missed packet” or a“match-miss” as used in OpenFlow parlance) arrives at the data plane780, the packet (or a subset of the packet header and content) istypically forwarded to the centralized control plane 776. Thecentralized control plane 776 will then program forwarding table entriesinto the data plane 780 to accommodate packets belonging to the flow ofthe unknown packet. Once a specific forwarding table entry has beenprogrammed into the data plane 780 by the centralized control plane 776,the next packet with matching credentials will match that forwardingtable entry and take the set of actions associated with that matchedentry.

A network interface (NI) may be physical or virtual; and in the contextof IP, an interface address is an IP address assigned to a NI, be it aphysical NI or virtual NI. A virtual NI may be associated with aphysical NI, with another virtual interface, or stand on its own (e.g.,a loopback interface, a point-to-point protocol interface). A NI(physical or virtual) may be numbered (a NI with an IP address) orunnumbered (a NI without an IP address). A loopback interface (and itsloopback address) is a specific type of virtual NI (and IP address) of aNE/VNE (physical or virtual) often used for management purposes; wheresuch an IP address is referred to as the nodal loopback address. The IPaddress(es) assigned to the NI(s) of a ND are referred to as IPaddresses of that ND; at a more granular level, the IP address(es)assigned to NI(s) assigned to a NE/VNE implemented on a ND can bereferred to as IP addresses of that NE/VNE.

Next hop selection by the routing system for a given destination mayresolve to one path (that is, a routing protocol may generate one nexthop on a shortest path); but if the routing system determines there aremultiple viable next hops (that is, the routing protocol generatedforwarding solution offers more than one next hop on a shortestpath—multiple equal cost next hops), some additional criteria is used -for instance, in a connectionless network, Equal Cost Multi Path (ECMP)(also known as Equal Cost Multi Pathing, multipath forwarding and IPmultipath) may be used (e.g., typical implementations use as thecriteria particular header fields to ensure that the packets of aparticular packet flow are always forwarded on the same next hop topreserve packet flow ordering). For purposes of multipath forwarding, apacket flow is defined as a set of packets that share an orderingconstraint. As an example, the set of packets in a particular TCPtransfer sequence need to arrive in order, else the TCP logic willinterpret the out of order delivery as congestion and slow the TCPtransfer rate down.

A Layer 3 (L3) Link Aggregation (LAG) link is a link directly connectingtwo NDs with multiple IP-addressed link paths (each link path isassigned a different IP address), and a load distribution decisionacross these different link paths is performed at the ND forwardingplane; in which case, a load distribution decision is made between thelink paths.

Some NDs include functionality for authentication, authorization, andaccounting (AAA) protocols (e.g., RADIUS (Remote Authentication Dial-InUser Service), Diameter, and/or TACACS+ (Terminal Access ControllerAccess Control System Plus). AAA can be provided through a client/servermodel, where the AAA client is implemented on a ND and the AAA servercan be implemented either locally on the ND or on a remote electronicdevice coupled with the ND. Authentication is the process of identifyingand verifying a subscriber. For instance, a subscriber might beidentified by a combination of a username and a password or through aunique key. Authorization determines what a subscriber can do afterbeing authenticated, such as gaining access to certain electronic deviceinformation resources (e.g., through the use of access controlpolicies). Accounting is recording user activity. By way of a summaryexample, end user devices may be coupled (e.g., through an accessnetwork) through an edge ND (supporting AAA processing) coupled to coreNDs coupled to electronic devices implementing servers ofservice/content providers. AAA processing is performed to identify for asubscriber the subscriber record stored in the AAA server for thatsubscriber. A subscriber record includes a set of attributes (e.g.,subscriber name, password, authentication information, access controlinformation, rate-limiting information, policing information) usedduring processing of that subscriber's traffic.

Certain NDs (e.g., certain edge NDs) internally represent end userdevices (or sometimes customer premise equipment (CPE) such as aresidential gateway (e.g., a router, modem)) using subscriber circuits.A subscriber circuit uniquely identifies within the ND a subscribersession and typically exists for the lifetime of the session. Thus, a NDtypically allocates a subscriber circuit when the subscriber connects tothat ND, and correspondingly de-allocates that subscriber circuit whenthat subscriber disconnects. Each subscriber session represents adistinguishable flow of packets communicated between the ND and an enduser device (or sometimes CPE such as a residential gateway or modem)using a protocol, such as the point-to-point protocol over anotherprotocol (PPPoX) (e.g., where X is Ethernet or Asynchronous TransferMode (ATM)), Ethernet, 802.1Q Virtual LAN (VLAN), Internet Protocol, orATM). A subscriber session can be initiated using a variety ofmechanisms (e.g., manual provisioning a dynamic host configurationprotocol (DHCP), DHCP/client-less Internet protocol service (CLIPS) orMedia Access Control (MAC) address tracking). For example, thepoint-to-point protocol (PPP) is commonly used for digital subscriberline (DSL) services and requires installation of a PPP client thatenables the subscriber to enter a username and a password, which in turnmay be used to select a subscriber record. When DHCP is used (e.g., forcable modem services), a username typically is not provided; but in suchsituations other information (e.g., information that includes the MACaddress of the hardware in the end user device (or CPE)) is provided.The use of DHCP and CLIPS on the ND captures the MAC addresses and usesthese addresses to distinguish subscribers and access their subscriberrecords.

A virtual circuit (VC), synonymous with virtual connection and virtualchannel, is a connection oriented communication service that isdelivered by means of packet mode communication. Virtual circuitcommunication resembles circuit switching, since both are connectionoriented, meaning that in both cases data is delivered in correct order,and signaling overhead is required during a connection establishmentphase. Virtual circuits may exist at different layers. For example, atlayer 4, a connection oriented transport layer datalink protocol such asTransmission Control Protocol (TCP) may rely on a connectionless packetswitching network layer protocol such as IP, where different packets maybe routed over different paths, and thus be delivered out of order.Where a reliable virtual circuit is established with TCP on top of theunderlying unreliable and connectionless IP protocol, the virtualcircuit is identified by the source and destination network socketaddress pair, i.e. the sender and receiver IP address and port number.However, a virtual circuit is possible since TCP includes segmentnumbering and reordering on the receiver side to prevent out-of-orderdelivery. Virtual circuits are also possible at Layer 3 (network layer)and Layer 2 (datalink layer); such virtual circuit protocols are basedon connection oriented packet switching, meaning that data is alwaysdelivered along the same network path, i.e. through the same NEs/VNEs.In such protocols, the packets are not routed individually and completeaddressing information is not provided in the header of each datapacket; only a small virtual channel identifier (VCI) is required ineach packet; and routing information is transferred to the NEs/VNEsduring the connection establishment phase; switching only involveslooking up the virtual channel identifier in a table rather thananalyzing a complete address. Examples of network layer and datalinklayer virtual circuit protocols, where data always is delivered over thesame path: X.25, where the VC is identified by a virtual channelidentifier (VCI); Frame relay, where the VC is identified by a VCI;Asynchronous Transfer Mode (ATM), where the circuit is identified by avirtual path identifier (VPI) and virtual channel identifier (VCI) pair;General Packet Radio Service (GPRS); and Multiprotocol label switching(MPLS), which can be used for IP over virtual circuits (Each circuit isidentified by a label).

Certain NDs (e.g., certain edge NDs) use a hierarchy of circuits. Theleaf nodes of the hierarchy of circuits are subscriber circuits. Thesubscriber circuits have parent circuits in the hierarchy that typicallyrepresent aggregations of multiple subscriber circuits, and thus thenetwork segments and elements used to provide access networkconnectivity of those end user devices to the ND. These parent circuitsmay represent physical or logical aggregations of subscriber circuits(e.g., a virtual local area network (VLAN), a permanent virtual circuit(PVC) (e.g., for Asynchronous Transfer Mode (ATM)), a circuit-group, achannel, a pseudo-wire, a physical NI of the ND, and a link aggregationgroup). A circuit-group is a virtual construct that allows various setsof circuits to be grouped together for configuration purposes, forexample aggregate rate control. A pseudo-wire is an emulation of a layer2 point-to-point connection-oriented service. A link aggregation groupis a virtual construct that merges multiple physical NIs for purposes ofbandwidth aggregation and redundancy. Thus, the parent circuitsphysically or logically encapsulate the subscriber circuits.

Each VNE (e.g., a virtual router, a virtual bridge (which may act as avirtual switch instance in a Virtual Private LAN Service (VPLS) istypically independently administrable. For example, in the case ofmultiple virtual routers, each of the virtual routers may share systemresources but is separate from the other virtual routers regarding itsmanagement domain, AAA (authentication, authorization, and accounting)name space, IP address, and routing database(s). Multiple VNEs may beemployed in an edge ND to provide direct network access and/or differentclasses of services for subscribers of service and/or content providers.

Within certain NDs, “interfaces” that are independent of physical NIsmay be configured as part of the VNEs to provide higher-layer protocoland service information (e.g., Layer 3 addressing). The subscriberrecords in the AAA server identify, in addition to the other subscriberconfiguration requirements, to which context (e.g., which of theVNEs/NEs) the corresponding subscribers should be bound within the ND.As used herein, a binding forms an association between a physical entity(e.g., physical NI, channel) or a logical entity (e.g., circuit such asa subscriber circuit or logical circuit (a set of one or more subscribercircuits)) and a context's interface over which network protocols (e.g.,routing protocols, bridging protocols) are configured for that context.Subscriber data flows on the physical entity when some higher-layerprotocol interface is configured and associated with that physicalentity.

Some NDs provide support for implementing VPNs (Virtual PrivateNetworks) (e.g., Layer 2 VPNs and/or Layer 3 VPNs). For example, the NDwhere a provider's network and a customer's network are coupled arerespectively referred to as PEs (Provider Edge) and CEs (Customer Edge).In a Layer 2 VPN, forwarding typically is performed on the CE(s) oneither end of the VPN and traffic is sent across the network (e.g.,through one or more PEs coupled by other NDs). Layer 2 circuits areconfigured between the CEs and PEs (e.g., an Ethernet port, an ATMpermanent virtual circuit (PVC), a Frame Relay PVC). In a Layer 3 VPN,routing typically is performed by the PEs. By way of example, an edge NDthat supports multiple VNEs may be deployed as a PE; and a VNE may beconfigured with a VPN protocol, and thus that VNE is referred as a VPNVNE.

Some NDs provide support for VPLS (Virtual Private LAN Service). Forexample, in a VPLS network, end user devices access content/servicesprovided through the VPLS network by coupling to CEs, which are coupledthrough PEs coupled by other NDs. VPLS networks can be used forimplementing triple play network applications (e.g., data applications(e.g., high-speed Internet access), video applications (e.g., televisionservice such as IPTV (Internet Protocol Television), VoD(Video-on-Demand) service), and voice applications (e.g., VoIP (Voiceover Internet Protocol) service)), VPN services, etc. VPLS is a type oflayer 2 VPN that can be used for multi-point connectivity. VPLS networksalso allow end use devices that are coupled with CEs at separategeographical locations to communicate with each other across a Wide AreaNetwork (WAN) as if they were directly attached to each other in a LocalArea Network (LAN) (referred to as an emulated LAN).

In VPLS networks, each CE typically attaches, possibly through an accessnetwork (wired and/or wireless), to a bridge module of a PE via anattachment circuit (e.g., a virtual link or connection between the CEand the PE). The bridge module of the PE attaches to an emulated LANthrough an emulated LAN interface. Each bridge module acts as a “VirtualSwitch Instance” (VSI) by maintaining a forwarding table that maps MACaddresses to pseudowires and attachment circuits. PEs forward frames(received from CEs) to destinations (e.g., other CEs, other PEs) basedon the MAC destination address field included in those frames.

Some portions of the preceding detailed descriptions have been presentedin terms of algorithms and symbolic representations of transactions ondata bits within a computer memory. These algorithmic descriptions andrepresentations are the ways used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of transactions leading to adesired result. The transactions are those requiring physicalmanipulations of physical quantities. Usually, though not necessarily,these quantities take the form of electrical or magnetic signals capableof being stored, transferred, combined, compared, and otherwisemanipulated. It has proven convenient at times, principally for reasonsof common usage, to refer to these signals as bits, values, elements,symbols, characters, terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise as apparent from the above discussion, itis appreciated that throughout the description, discussions utilizingterms such as “processing” or “computing” or “calculating” or“determining” or “displaying” or the like, refer to the action andprocesses of a computer system, or similar electronic computing device,that manipulates and transforms data represented as physical(electronic) quantities within the computer system's registers andmemories into other data similarly represented as physical quantitieswithin the computer system memories or registers or other suchinformation storage, transmission or display devices.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general-purposesystems may be used with programs in accordance with the teachingsherein, or it may prove convenient to construct more specializedapparatus to perform the required method transactions. The requiredstructure for a variety of these systems will appear from thedescription above. In addition, embodiments of the present invention arenot described with reference to any particular programming language. Itwill be appreciated that a variety of programming languages may be usedto implement the teachings of embodiments of the invention as describedherein.

In the foregoing specification, embodiments of the invention have beendescribed with reference to specific exemplary embodiments thereof. Itwill be evident that various modifications may be made thereto withoutdeparting from the broader spirit and scope of the invention as setforth in the following claims. The specification and drawings are,accordingly, to be regarded in an illustrative sense rather than arestrictive sense.

Throughout the description, embodiments of the present invention havebeen presented through flow diagrams. It will be appreciated that theorder of transactions and transactions described in these flow diagramsare only intended for illustrative purposes and not intended as alimitation of the present invention. One having ordinary skill in theart would recognize that variations can be made to the flow diagramswithout departing from the broader spirit and scope of the invention asset forth in the following claims.

What is claimed is:
 1. A method implemented by a networking devicefunctioning as a computing node, the method to resolve sub-trees of aloosely specified multicast distribution tree (MDT), the method toutilize global identifier for sub-trees to enable differentiation oftraffic of different sub-trees at shared replication nodes, the methodimplemented at each of the nodes of the network that are part of theMDT, the method comprising: selecting a sub-tree in the set of sub-treesin the MDT rooted at a current node; computing a selected sub-tree fromroot to leaves; and generating a translation of sub-tree identifiersbetween the sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.
 2. The method of claim1, further comprising: checking whether any leaves of sub-trees areroots that have failed; and merging the sub-trees with leafs that arethe roots that failed with the sub-trees with the failed root.
 3. Themethod of claim 1, further comprising: installing state by the computingnode to reach leaves or replication nodes in the selected sub-tree. 4.The method of claim 1, wherein each the global identifiers are labels,and generating the translation is a cross-connect of the labels.
 5. Themethod of claim 1, wherein the loosely specified MDT is defined in amulti-protocol label switching (MPLS) or source packet routing innetworking (SPRING) segment routing instantiation.
 6. The method ofclaim 1, wherein sub-tree descriptors and hierarchical relationship ofthe sub-trees has been communicated by a routing protocol of adistributed routing system.
 7. A network device configured to implementa method to resolve sub-trees of a loosely specified multicastdistribution tree (MDT), the method to utilize global identifiers forsub-trees to enable differentiation of traffic of different sub-trees atshared replication nodes, the method implemented at each of the nodes ofthe network that are part of the MDT, the network device comprising: anon-transitory machine-readable medium to store a sub-tree computationmodule; and a processor coupled to the non-transitory machine-readablemedium to store a sub-tree computation module, the sub-tree computationmodule configured to select a next sub-tree in the set of sub-trees inthe MDT rooted at a current node, to compute a selected sub-tree fromroot to leaves, and to generate a translation of sub-tree identifiersbetween the sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.
 8. The network deviceof claim 7, wherein the sub-tree computation module is furtherconfigured to check whether any leaves of sub-trees are roots that havefailed, and merging the sub-trees with leafs that are the roots thatfailed with the sub-trees with the failed root.
 9. The network device ofclaim 7, wherein the sub-tree computation module is further configuredto install state to reach leaves or replication nodes in the selectedsub-tree.
 10. The network device of claim 7, wherein each the globalidentifiers are labels, and generating the translation is across-connect of the labels.
 11. The network device of claim 7, whereinthe loosely specified MDT is defined in a multi-protocol label switching(MPLS) or source packet routing in networking (SPRING) segment routinginstantiation.
 12. The network device of claim 7, wherein sub-treedescriptors and hierarchical relationship of the sub-trees has beencommunicated by a routing protocol of a distributed routing system. 13.A computing device in communication with a network device in a networkwith a plurality of network devices, the computing device to execute aplurality of virtual machines for implementing network functionvirtualization (NFV), wherein a virtual machine from the plurality ofvirtual machines is configured to implement a method to resolvesub-trees of a loosely specified multicast distribution tree (MDT), themethod to utilize global identifiers for sub-trees to enabledifferentiation of traffic of different sub-trees at shared replicationnodes, the method implemented at each of the nodes of the network thatare part of the MDT, the network device comprising: a non-transitorymachine-readable medium to store a sub-tree computation module; and aprocessor coupled to the non-transitory machine-readable medium to storea sub-tree computation module, the sub-tree computation moduleconfigured to select a next sub-tree in the set of sub-trees in the MDTrooted at a current node, to compute a selected sub-tree from root toleaves, and to generate a translation of sub-tree identifiers betweenthe sub-tree identifiers of the selected sub-tree and a sub-treeidentifier of an upstream sub-tree, in response to the computing nodebeing the sub-tree root of the selected sub-tree.
 14. The computingdevice of claim 13, wherein the sub-tree computation module is furtherconfigured to check whether any leaves of sub-trees are roots that havefailed, and merging the sub-trees with leafs that are the roots thatfailed with the sub-trees with the failed root.
 15. The computing deviceof claim 13, wherein the sub-tree computation module is furtherconfigured to install state to reach leaves or replication nodes in theselected sub-tree.
 16. The computing device of claim 13, wherein eachthe global identifiers are labels, and generating the translation is across-connect of the labels.
 17. The computing device of claim 13,wherein the loosely specified MDT is defined in a multi-protocol labelswitching (MPLS) or source packet routing in networking (SPRING) segmentrouting instantiation.
 18. A control plane device is configured toimplement a control plane of a software defined networking (SDN) networkincluding a network device in a network with a plurality of networkdevices, wherein the control plane device is configured to implement amethod to resolve sub-trees of a loosely specified multicastdistribution tree (MDT), the method to utilize global identifiers forsub-trees to enable differentiation of traffic of different sub-trees atshared replication nodes, the method implemented at each of the nodes ofthe network that are part of the MDT, the control plane devicecomprising: a non-transitory machine-readable medium to store a sub-treecomputation module; and a processor coupled to the non-transitorymachine-readable medium to store a sub-tree computation module, thesub-tree computation module configured to select a next sub-tree in theset of sub-trees in the MDT rooted at a current node, to compute aselected sub-tree from root to leaves, and to generate a translation ofsub-tree identifiers between the sub-tree identifiers of the selectedsub-tree and a sub-tree identifier of an upstream sub-tree, in responseto the computing node being the sub-tree root of the selected sub-tree.19. The control plane device of claim 18, wherein the sub-treecomputation module is further configured to check whether any leaves ofsub-trees are roots that have failed, and merging the sub-trees withleafs that are the roots that failed with the sub-trees with the failedroot.
 20. The control plane device of claim 18, wherein the sub-treecomputation module is further configured to install state to reachleaves or replication nodes in the selected sub-tree.
 21. The controlplane device of claim 18, wherein each the global identifiers arelabels, and generating the translation is a cross-connect of the labels.22. The control plane device of claim 18, wherein the loosely specifiedMDT is defined in a multi-protocol label switching (MPLS) or sourcepacket routing in networking (SPRING) segment routing instantiation.